Algorithmic height compression of unordered trees
نویسندگان
چکیده
منابع مشابه
Algorithmic height compression of unordered trees.
By nature, tree structures frequently present similarities between their sub-parts. Making use of this redundancy, different types of tree compression techniques have been designed in the literature to reduce the complexity of tree structures. A popular and efficient way to compress a tree consists of merging its isomorphic subtrees, which produces a directed acyclic graph (DAG) equivalent to t...
متن کاملCompression of Unordered XML Trees
Many XML documents are data-centric and do not make use of the inherent document order. Can we provide stronger compression for such documents through giving up order? We first consider compression via minimal dags (directed acyclic graphs) and study the worst case ratio of the size of the ordered dag divided by the size of the unordered dag, where the worst case is taken for all trees of size ...
متن کاملDeterministic Automata for Unordered Trees
Automata for unordered unranked trees are relevant for defining schemas and queries for data trees in JSON or XML format. While the existing notions are well-investigated concerning expressiveness, they all lack a proper notion of determinism, which makes it difficult to distinguish subclasses of automata for which problems such as inclusion, equivalence, and minimization can be solved efficien...
متن کاملDrawing Unordered Trees on k-Grids
We present almost linear area bounds for drawing complete trees on the octagonal grid. For 7-ary trees we establish an upper and lower bound of Θ(n1.129) and for ternary trees the bounds of O(n1.048) and Θ(n), where the latter needs edge bends. We explore the unit edge length and area complexity of drawing unordered trees on k-grids with k ∈ {4, 6, 8} and generalize the N P-hardness results of ...
متن کاملEfficiently Mining Frequent Embedded Unordered Trees
Mining frequent trees is very useful in domains like bioinformatics, web mining, mining semi-structured data, and so on. In this paper we introduce SLEUTH, an efficient algorithm for mining frequent, unordered, embedded subtrees in a database of labeled trees. The key contributions of our work are as follows: We give the first algorithm that enumerates all embedded, unordered trees. We propose ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Theoretical Biology
سال: 2016
ISSN: 0022-5193
DOI: 10.1016/j.jtbi.2015.10.030